Succinct Set-Encoding for State-Space Search
نویسندگان
چکیده
We introduce the level-ordered edge sequence (LOES), a succinct encoding for state-sets based on prefix-trees. For use in state-space search, we give algorithms for member testing and element hashing with runtime dependent only on state size, as well as time and memory efficient construction of and iteration over such sets. Finally we compare LOES to binary decision diagrams (BDDs) and explicitly packed setrepresentation over a range of IPC planning problems. Our results show LOES produces succinct set-encodings for a wider range of planning problems than both BDDs and explicit state representation, increasing the number of problems that can be solved cost-optimally.
منابع مشابه
MSQ-Index: A Succinct Index for Fast Graph Similarity Search
Graph similarity search has received considerable attention in many applications, such as bioinformatics, data mining, pattern recognition, and social networks. Existing methods for this problem have limited scalability because of the huge amount of memory they consume when handling very large graph databases with millions or billions of graphs. In this paper, we study the problem of graph simi...
متن کاملSymbolic Search
Symbolic search solves state space problems consisting of an initial state, a set of goal states, and a set of actions using a succinct representation for state sets. The approach lessens the costs associated with the exponential memory requirements for the state sets involved as problem sizes get bigger. Symbolic search has been associated with the term planning via model checking (Giunchiglia...
متن کاملInverse Reinforcement Learning based on Critical State
Inverse reinforcement learning is tried to search a reward function based on Markov Decision Process. In the IRL topics, experts produce some good traces to make agents learn and adjust the reward function. But the function is difficult to set in some complicate problems. In this paper, Inverse Reinforcement Learning based on Critical State (IRLCS) is proposed to search a succinct and meaningfu...
متن کاملNumeric Planning with Disjunctive Global Constraints via SMT
This paper describes a novel encoding for sequential numeric planning into the problem of determining the satisfiability of a logical theory T . We introduce a novel technique, orthogonal to existing work aiming at producing more succinct encodings that enables the theory solver to roll up an unbounded yet finite number of instances of an action into a single plan step, greatly reducing the hor...
متن کاملSuccinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits to support orthogonal range counting in O(lg n/ lg lg n) time, and range reporting in O(k lg n/ lg lg n) time, where k is the size of the output. This achieves an improvement on query time by a factor of lg lg n upon the previous result of Mäkinen and Navarro [1], while using essentially the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011